Combinatorial optimization

Results: 1158



#Item
31A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin  DIAMANT Symposium – November 2012

A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012

Add to Reading List

Source URL: www.daviddelaat.nl

Language: English
32Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald  Roger Wattenhofer

Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:25
33Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

Add to Reading List

Source URL: cvit.iiit.ac.in

Language: English - Date: 2015-08-05 23:33:31
34A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken

Add to Reading List

Source URL: eda.mmci.uni-saarland.de

Language: English - Date: 2014-10-01 09:01:01
35A UNIFIED ALGORITHMIC APPROACH TO DISTRIBUTED OPTIMIZATION João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 2

A UNIFIED ALGORITHMIC APPROACH TO DISTRIBUTED OPTIMIZATION João F. C. Mota1,2 , João M. F. Xavier2 , Pedro M. Q. Aguiar2 , and Markus Püschel3 1 2

Add to Reading List

Source URL: users.isr.ist.utl.pt

Language: English - Date: 2013-09-21 01:26:18
36The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

The Generalized Median Stable Matchings: finding them is not that easy Christine T. Cheng Department of Computer Science University of Wisconsin–Milwaukee, Milwaukee, WI 53211, USA.

Add to Reading List

Source URL: www.cs.uwm.edu

Language: English - Date: 2008-01-18 16:08:54
37The University of Georgia 2012 Academic Affairs Faculty Symposium Unicoi Conference Center March, 2012  Panel I. Models for Integration

The University of Georgia 2012 Academic Affairs Faculty Symposium Unicoi Conference Center March, 2012 Panel I. Models for Integration

Add to Reading List

Source URL: teachingacademy.uga.edu

Language: English - Date: 2014-07-09 15:34:37
38Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30

Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30

Add to Reading List

Source URL: www.or.uni-bonn.de

Language: English - Date: 2008-11-04 22:42:02
39Microsoft Word - IBSAlgorithms.doc

Microsoft Word - IBSAlgorithms.doc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-02-02 08:45:53
40Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Add to Reading List

Source URL: emarkou.users.uth.gr

Language: English - Date: 2016-05-24 11:28:44